Three-regular Subgraphs of Four-regular Graphs
نویسندگان
چکیده
منابع مشابه
Three-regular Subgraphs of Four-regular Graphs'
The Berge–Sauer conjecture (see [2, 3]) says that any simple (no multiple edges and loops) 4-regular graph contains a 3-regular subgraph. This conjecture was proved in [4, 6]. In [1, 2] the Chevalley–Warning theorem was used to extend this result to graphs with multiple edges, which are 4-regular plus an edge. Our main result, Theorem 2.2, presents the sufficient condition for a 4-regular graph...
متن کاملRegular subgraphs of almost regular graphs
Suppose every vertex of a graph G has degree k or k + 1 and at least one vertex has degree k + 1. It is shown that if k > 2q 2 and q is a prime power then G contains a q-regular subgraph (and hence an r-regular subgraph for all r < q. r = q (mod 2)). It is also proved that every simple graph with maximal degree A > 2q 2 and average degree d > ((2q 2)/(2q l))(A + 1), where q is a prime power, co...
متن کاملRegular subgraphs of random graphs
In this paper, we prove that there exists a function ρk = (4 + o(1))k such that G(n, ρ/n) contains a k-regular graph with high probability whenever ρ > ρk. In the case of k = 3, it is also shown that G(n, ρ/n) contains a 3-regular graph with high probability whenever ρ > λ ≈ 5.1494. These are the first constant bounds on the average degree in G(n, p) for the existence of a k-regular subgraph. W...
متن کاملDistribution of subgraphs of random regular graphs
The asymptotic distribution of small subgraphs of a random graph has been basically worked out (see Ruciński [5] for example). But for random regular graphs, the main techniques for proving, for instance, asymptotic normality, do not seem to be usable. One very recent result in this direction is to be found in [3], where switchings were applied to cycle counts. The aim of the present note is to...
متن کاملSmall subgraphs of random regular graphs
The main aim of this short paper is to answer the following question. Given a fixed graph H , for which values of the degree d does a random d-regular graph on n vertices contain a copy of H with probability close to one?
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1998
ISSN: 0195-6698
DOI: 10.1006/eujc.1997.0150